Robust DWDM Routing and Provisioning under Polyhedral Demand Uncertainty ∗
نویسندگان
چکیده
We present mixed integer linear programming models that are robust in the face of uncertain traffic demands known to lie in a certain polyhedron for the problem of dense wavelength division multiplexing network routing and provisioning at minimal cost. We investigate the solution of the problem in a set of numerical experiments for two models of polyhedral uncertainty: (a) the hose model, (b) a restricted interval uncertainty model. We report the results of these numerical experiments in comparison with an alternative model of robustness due to Kennington et al.
منابع مشابه
Robust Solutions for the DWDM Routing and Provisioning Problem: Models and Algorithms
The dense wavelength division multiplexing routing and provisioning problem with uncertain demands and a fixed budget is modeled as a multicriteria optimization problem. To obtain a robust design for this problem, the primary objective is to minimize a regret function that models the total amount of over and/or under provisioning in the network resulting from uncertainty in a demand forecast. P...
متن کاملScheduling Post-Distribution Cross-Dock under Demand Uncertainty
The system of distribution of goods and services, along with other economic developments around the world, is rapidly evolving. In the world of distribution of goods, the main focus is on making distribution operations more effective. Due to the fact that the cross-dock has the advantage of removing intermediaries and reducing the space required for the warehouse, it is worth considering. Among...
متن کاملSolving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under an Uncertainty Condition
This paper presents a novel bi-objective multi-product capacitated vehicle routing problem with uncertainty in demand of retailers and volume of products (UCVRP) and heterogeneous vehicle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used vehicles, fuel consumption for full loaded vehicles and shortage of products. The second ...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005